Scalable Distributed Job Processing with Dynamic Load Balancing
نویسندگان
چکیده
منابع مشابه
Scalable Distributed Job Processing with Dynamic Load Balancing
We present here a cost effective framework for a robust scalable and distributed job processing system that adapts to the dynamic computing needs easily with efficient load balancing for heterogeneous systems. The design is such that each of the components are self contained and do not depend on each other. Yet, they are still interconnected through an enterprise message bus so as to ensure saf...
متن کاملDynamic Load Balancing for Distributed
In this paper we study diffusion schemes for dynamic load balancing on message passing multiprocessor networks. One of the main results concerns conditions under which these dynamic schemes converge and their rates of convergence for arbitrary topologies. These results use the eigenstructure of the iteration matrices that arise in dynamic load balancing. We completely analyze the hypercube netw...
متن کاملScalable Load Distribution and Load Balancing for Dynamic Parallel Programs
This paper reports design and preliminary evaluation of an integrated load distribution-load balancing algorithm which was targeted to be both efficient and scalable for dynamically structured computations. The computation is represented as a dynamic hierarchical dependence graph. Each node of the graph may be a subgraph or a computation and the number of instances of each node is dynamically d...
متن کاملDynamic Load Balancing in Distributed Virtual Environments
This paper introduces a new approach for improving the scalability of distributed virtual environments by using a combination of visibility culling for communication and dynamic load balancing to keep the system load evenly distributed Further communication optimizations as well as some preliminary results are presented
متن کاملDynamic Load Balancing in Distributed Hash Tables
In Peer-to-Peer networks based on consistent hashing and ring topology, each server is responsible for an interval chosen (pseudo-) randomly on a unit circle. The topology of the network, the communication load, and the amount of data a server stores depend heavily on the length of its interval. Additionally, the nodes are allowed to join the network or to leave it at any time. Such operations ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed and Parallel systems
سال: 2013
ISSN: 2229-3957,0976-9757
DOI: 10.5121/ijdps.2013.4302